منابع مشابه
Enhanching MLP: Runahead Execution and Related Techniques
The growing memory wall1 makes speedups increasingly difficult to achieve on applications that exhibit difficult-topredict memory access patterns. The problem is that although modern processors provide multiple high-bandwidth execution units, applications that experience frequent cache misses are only executed with high IPC in the periods between misses. As main memory latencies increase from 2...
متن کاملNCOR: An FPGA-Friendly Nonblocking Data Cache for Soft Processors with Runahead Execution
Soft processors often use data caches to reduce the gap between processor and main memory speeds. To achieve high efficiency, simple, blocking caches are used. Such caches are not appropriate for processor designs such as Runahead and out-of-order execution that require nonblocking caches to tolerate main memory latencies. Instead, these processors use non-blocking caches to extract memory leve...
متن کاملPrecise-Restartable Execution of Parallel Programs
Precise interruptibility enabled a broad range of system capabilities and microarchitectural techniques in instructionlevel parallel processors. Arguably, it was key to the success of computers. Multiprocessors lack a similarly-capable feature. As parallelism evolves from instructions to threads or tasks, we envision a similar feature in future multiprocessors. We define precise restartability ...
متن کاملA Precise Execution Semantics for BPMN
Bringing a high confidence to the validity of business processes is one of the prevailing themes in business process management. Regardless of the introduction of BPMN 1.2, there is no discernible improvement in the preciseness of the BPMN semantics. Motivated by the need to ensure the trustworthiness of BPMN models and the absence of an accurate behavioural semantics, a rigorous semantic defin...
متن کاملPrecise and Progressing Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known technique for finding such assertion violations. It enjoys the following two interesting properties. First, symbolic execution is precise: if it reports that an assertion can fail, then there is an execution of the program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Computer Architecture Letters
سال: 2019
ISSN: 1556-6056,1556-6064,2473-2575
DOI: 10.1109/lca.2019.2910518